Graceful signed graphs: II. The case of signed cycles with connected negative sections
نویسندگان
چکیده
منابع مشابه
Graceful Signed Graphs on C k 3
In [4], we have proved the necessary condition for sigraphs on union of k copies cycles of length three with one vertex in common denoted by C 3 to be graceful and sufficiency part of the theorem was discussed in certain special cases when all rim edges are negative and form a maximum matching. In this paper, we discuss the sufficiency part of the theorem on gracefulness of sigraphs on C 3 part...
متن کاملOn signed digraphs with all cycles negative
It is known that signed graphs with all cycles negative are those in which each block is a negative cycle or a single line. We now study the more difficult problem for signed digraphs. In particular we investigate the structure of those digraphs whose arcs can be signed (positive or negative) so that every (directed) cycle is negative. Such digraphs are important because they are associated wit...
متن کاملOn net-Laplacian Energy of Signed Graphs
A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...
متن کاملMore Equienergetic Signed Graphs
The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...
متن کاملThe distribution of cycles in breakpoint graphs of signed permutations
Breakpoint graphs are ubiquitous structures in the field of genome rearrangements. Their cycle decomposition has proved useful in computing and bounding many measures of (dis)similarity between genomes, and studying the distribution of those cycles is therefore critical to gaining insight on the distributions of the genomic distances that rely on it. We extend here the work initiated by Doignon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2005
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-005-0002-4